Extraction of Face Features Using Various Techniques

This thesis aims at devising a novel method of feature extraction of face images which proves to be faster and more accurate than the existing methods defined by wavelet, curvelet and ridgelet transforms. DOST method of extracting features from face images keeps into account every minute detail of the face image i.e both spatial and frequency based features. The application of LDA method onto the DOST features in order to reduce the dimensionality of the method further helps in making the process of feature extraction faster and hence reduces the time complexity of the feature extraction method. The matching is done by using different similarity measures such as euclidean distance. Results from different methods are evaluated and compared to present the effectiveness of this new method for feature extraction

Implicit relations and their derivatives for symbolic state space generation

Formal verification collectively defines mathematics and logic-based techniques that aim to prove the correctness of a system design or implementation in the context of specified properties. Among several mechanisms to conduct formal verification, model checking is an automated process that relies on the colossal task of generating the entire state-space of systems, which in the real world can be highly complex and have an enormous number of states, before those states are verified. This dissertation focusses on symbolic techniques of state-space generation and investigates several mechanisms to formalize system designs that can expedite the state-of-the-art algorithm, saturation, for reachability generation. The proposed abstraction techniques of system design are novel as well as synthesized by combining with the best of the existing methods to complement certain phases of the saturation algorithm in a scalable manner. The work proposes multiple enhanced versions of the saturation algorithm that aim to achieve the scope generality of existing state-of-the-art techniques with an improved performance cost, at times, by orders of magnitude, as presented in the results

Implicit relations and their derivatives for symbolic state space generation

Formal verification collectively defines mathematics and logic-based techniques that aim to prove the correctness of a system design or implementation in the context of specified properties. Among several mechanisms to conduct formal verification, model checking is an automated process that relies on the colossal task of generating the entire state-space of systems, which in the real world can be highly complex and have an enormous number of states, before those states are verified. This dissertation focusses on symbolic techniques of state-space generation and investigates several mechanisms to formalize system designs that can expedite the state-of-the-art algorithm, saturation, for reachability generation. The proposed abstraction techniques of system design are novel as well as synthesized by combining with the best of the existing methods to complement certain phases of the saturation algorithm in a scalable manner. The work proposes multiple enhanced versions of the saturation algorithm that aim to achieve the scope generality of existing state-of-the-art techniques with an improved performance cost, at times, by orders of magnitude, as presented in the results